On the Relation Between "Semantically Tractable" Queries and AURA’s Question Formulation Facility

نویسنده

  • Peter Clark
چکیده

In our work on AURA, we are dealing with (controlled) natural language queries to a scientific knowledge base, and this paper explores the extent to which Popescu et al’s framework can be applied in the AURA context. The AURA task differs from the database task in several important ways, in particular the variety and complexity of questions is much more open-ended than in Popescu et als database work (Examples of some of the biology questions that AURA is intended to field are discussed in [3]). We briefly summarize Popescu et al’s work, and then explore the opportunities and challenges of applying it in a different context.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the computational complexity of finding a minimal basis for the guess and determine attack

Guess-and-determine attack is one of the general attacks on stream ciphers. It is a common cryptanalysis tool for evaluating security of stream ciphers. The effectiveness of this attack is based on the number of unknown bits which will be guessed by the attacker to break the cryptosystem. In this work, we present a relation between the minimum numbers of the guessed bits and uniquely restricted...

متن کامل

Implementing a Universal Relation Frontend for SQL

For querying a universal relation system the user only has to specify the output attributes he is interested in and the conditions for these attributes; the universal relation system computes the relevant part of the database scheme with respect to the query, the query hypergraph, and subsequently relations and join conditions corresponding to the query hypergraph. We introduce a universal rela...

متن کامل

Heuristic Methods Based on MINLP Formulation for Reliable Capacitated Facility Location Problems

This paper addresses a reliable facility location problem with considering facility capacity constraints. In reliable facility location problem some facilities may become unavailable from time to time. If a facility fails, its clients should refer to other facilities by paying the cost of retransfer to these facilities. Hence, the fail of facilities leads to disruptions in facility location dec...

متن کامل

Query Reformulation Strategies for an Intelligent Search Intermediary

This paper describes an intelligent search intermediary to help end-users locate relevant passages in large online full-text databases. Passage retrieval has advantages in efficiency and effectiveness over traditional document retrieval yet is more computationally tractable than question answering systems under development by researchers in artificial intelligence. However, casual users need as...

متن کامل

Question Paraphrase Generation for Question Answering System

The queries to a practical Question Answering (QA) system range from keywords, phrases, badly written questions, and occasionally grammatically perfect questions. Among different kinds of question analysis approaches, the pattern matching works well in analyzing such queries. It is costly to build this pattern matching module because tremendous manual labor is needed to expand its coverage to s...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009